Chromatic Polynomials of Fn×P2  Graphs: Algebraic Analysis and Scheduling Applications

Chromatic Polynomials of Fn×P2... | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/15-351" }, "headline": "Chromatic Polynomials of Fn×P2 Graphs: Algebraic Analysis and Scheduling Applications", "datePublished": "2026-03-04T10:33:51", "dateModified": "2026-03-04T10:33:51", "author": [ { "@type": "Person", "name": "Sarah M. Talab" }, { "@type": "Person", "name": "Nabeel E. Arif" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": " Background Chromatic polynomials are fundamental algebraic invariants in graph theory, bridging pure mathematics and practical applications. While extensive results exist for paths and cycles, the Cartesian product F n × P 2 remains largely unexplored despite its layered constraint structure, presenting a clear gap in the literature. Methods We employ combinatorial decomposition and recursive block construction, applying the inclusion–exclusion principle to the eight edge constraints within each recursive unit. This analytical approach enables the derivation of the chromatic transition polynomial ψ ( k ) , which governs the recurrence relations and closed-form expressions. Results We establish the recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) and the closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) where ψ ( k ) = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 . The chromatic number is proven to be χ = 3 , with real roots of ψ ( k ) located within [2,3]. Numerical validation confirms both recurrence and closed-form formulas, while asymptotic analysis shows the exponential growth of P n ( k ) is governed by ψ ( k ) , as lim n → ∞ [ P n ( k ) ] 1 n = | ψ ( k ) | . Conclusions This research provides a comprehensive algebraic characterization of the chromatic polynomial for F n × P 2 , deriving its recurrence relation and closed-form expression. Building on this foundation, we develop a novel two-period conference scheduling model where the chromatic polynomial serves as a quantitative tool to compute all conflict-free room allocations. This work demonstrates directly how structural graph theory can inform practical resource allocation systems, transforming an abstract invariant into a concrete decision-support tool. " } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/15-351", "name": "Chromatic Polynomials of Fn×P2 Graphs: Algebraic Analysis and..." } } ] } Home Browse Chromatic Polynomials of Fn×P2 Graphs: Algebraic Analysis and... ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article M. Talab S and E. Arif N. Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.12688/f1000research.176896.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Research Article Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] Sarah M. Talab https://orcid.org/0009-0006-4160-4240 1 , Nabeel E. Arif 1 Sarah M. Talab https://orcid.org/0009-0006-4160-4240 1 , Nabeel E. Arif 1 PUBLISHED 04 Mar 2026 Author details Author details 1 Mathematics, Tikrit University, Tikrit, Saladin Governorate, 34001, Iraq Sarah M. Talab Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Resources, Validation, Visualization, Writing – Original Draft Preparation, Writing – Review & Editing Nabeel E. Arif Roles: Supervision OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the Fallujah Multidisciplinary Science and Innovation gateway. Abstract Background Chromatic polynomials are fundamental algebraic invariants in graph theory, bridging pure mathematics and practical applications. While extensive results exist for paths and cycles, the Cartesian product F n × P 2 remains largely unexplored despite its layered constraint structure, presenting a clear gap in the literature. Methods We employ combinatorial decomposition and recursive block construction, applying the inclusion–exclusion principle to the eight edge constraints within each recursive unit. This analytical approach enables the derivation of the chromatic transition polynomial ψ ( k ) , which governs the recurrence relations and closed-form expressions. Results We establish the recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) and the closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) where ψ ( k ) = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 . The chromatic number is proven to be χ = 3 , with real roots of ψ ( k ) located within [2,3]. Numerical validation confirms both recurrence and closed-form formulas, while asymptotic analysis shows the exponential growth of P n ( k ) is governed by ψ ( k ) , as lim n → ∞ [ P n ( k ) ] 1 n = | ψ ( k ) | . Conclusions This research provides a comprehensive algebraic characterization of the chromatic polynomial for F n × P 2 , deriving its recurrence relation and closed-form expression. Building on this foundation, we develop a novel two-period conference scheduling model where the chromatic polynomial serves as a quantitative tool to compute all conflict-free room allocations. This work demonstrates directly how structural graph theory can inform practical resource allocation systems, transforming an abstract invariant into a concrete decision-support tool. READ ALL READ LESS Keywords Graph coloring, Chromatic polynomial, Cartesian product, Friendship graph, Combinatorial mathematics, Recurrence relation, Closed-form expression, Scheduling. Corresponding Author(s) Sarah M. Talab ( [email protected] ) Close Corresponding author: Sarah M. Talab Competing interests: No competing interests were disclosed. Grant information: The author(s) declared that no grants were involved in supporting this work. Copyright: © 2026 M. Talab S and E. Arif N. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: M. Talab S and E. Arif N. Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.12688/f1000research.176896.1 ) First published: 04 Mar 2026, 15 :351 ( https://doi.org/10.12688/f1000research.176896.1 ) Latest published: 04 Mar 2026, 15 :351 ( https://doi.org/10.12688/f1000research.176896.1 ) 1. Introduction Chromatic polynomials are considered a fundamental tool in algebraic graph theory. Initially introduced by Birkhoff (1912) in his attempt to prove the four-color conjecture, their development was profoundly advanced by Whitney’s (1932) deletion-contraction recurrence and Read’s (1968) systematic studies, culminating in a comprehensive review by Tutte and Read (1988). The chromatic polynomial P ( G , k ) , which counts the proper k -colorings of a graph G , also bears significant practical importance. It serves as a critical tool in diverse applied fields, including task scheduling, 1 data analysis, 2 network design, 3 theoretical chemistry, 4 and statistical physics. 5 However, computing the chromatic polynomial remains a challenging problem, particularly for graphs constructed from Cartesian products ( G × H ) , where determining a general formula relating P ( G × H , k ) to its factor polynomials is NP -hard. This challenge has encouraged the derivation of closed-form expressions for specific graph classes. The properties of Cartesian products, including their coloring characteristics, have provided a solid theoretical basis for studying composite graphs. 6 The effect of these graph operations on coloring and dominance has been widely investigated as a key to understanding the structure of composite graphs. 7 Notably, recent studies have successfully derived chromatic polynomials for other composite structures, such as the Triangular Snake and the n-Centipede graphs using structural recursion. 8 While significant research has focused on Cartesian products of basic graphs, such as paths ( P n ) and cycles( C n ), 9 – 12 the structure F n × P 2 —formed by the Cartesian product of a friendship graph and a 2-path—has received little attention. Its unique composition, which interlaces local triangular clusters with a linear, two-layer framework, presents a compelling subject for algebraic graph theory. This paper provides a complete analytical framework for F n × P 2 by: • Deriving its recurrence relation and a closed-form expression for its chromatic polynomial. • Establishing its chromatic number, analyzing the root distribution of its transition polynomial, and determining its asymptotic growth rate. • Validating the theoretical results through numerical computation. • Demonstrating its practical utility via a novel application to a two-period conference scheduling problem. This practical approach aligns with recent results 1 , 13 that confirm the utility of graph coloring in modeling scheduling constraints and resolving resource conflicts, thereby reinforcing the practical relevance of our findings. 2. Preliminaries Definition 2.1 14 : A friendship graph, denotes F n for n ≥ 2 , and it’s defined as the union of n copies of cycles ( C 3 ) with a common vertex (the center). Formally: • Vertex set: V ( F n ) = { v 0 } ∪ { u i , w i } i = 1 n where v 0 is the center vertex. • Edge set: E ( F n ) = { ( v 0 , u i ) , ( v 0 , w i ) , ( u i , w i ) } i = 1 n . • Order: | V ( F n ) | = 2 n + 1 . • Size: | E ( F n ) | = 3 n . Figure 1 (Friendship graphs F n ): Definition 2.2 6 : The Cartesian product of two graphs G and H denotes ( G × H ) and it’s known as a graph in which each vertex is an ordered pair ( u , w ) where u ∈ V ( G ) and w ∈ V ( H ) , creating an edge between two vertices ( u 1 , w 1 ) and ( u 2 , w 2 ) . if: • u 1 = u 2 and w 1 is adjacent to w 2 in H , or • w 1 = w 2 and u 1 is adjacent to u 2 in G . Definition 2.3 15 : The chromatic polynomial P ( G , k ) is a polynomial in k that expresses the number of proper vertex k -colorings of G , such that adjacent vertices share distinct colors. Definition 2.4: The graph F n × P 2 is the Cartesian product of a friendship graph F n with a path P 2 , forming two parallel layers of F n with corresponding vertices connected by edges. Figure 2 (Cartesian product F n × P 2 ): Figure 1. Friendship graphs F n for n = 2 , 3 , 4 , 5 . Each graph is formed by n triangles sharing a common central vertex v 0 , illustrating the recursive structure of the friendship graph family. Figure 2. Structure of the Cartesian Product F n × P 2 for n = 2 , 3 , 4 , 5 . This construction yields two parallel layers of F n , with corresponding vertices connected by vertical edges. 3. Methods 3.1 Analytical framework and structural decomposition This is a theoretical study in algebraic and combinatorial graph theory, analyzing the chromatic polynomial of the graph family G n = F n × P 2 . The core of our approach is a structural decomposition that reveals a recursive construction. For n ≥ 3 , G n is obtained from G n − 1 by attaching a new block B n .This block contains four new vertices { u n A , w n A , u n B , w n B } and eight edges that form two new triangles (one in each layer) along with their vertical connections. Crucially, B n attaches only to the two central vertices v 0 A and v 0 B of G n − 1 . This localized, exclusive attachment is the key to isolating the chromatic contribution of each step. 3.2 Combinatorial derivation of the transition polynomial ψ ( k ) The proper coloring of the new block B n depends solely on the colors assigned to its two attachment points, v 0 A and v 0 B , which must be distinct in any proper coloring of the base graph G n − 1 . We compute the number of proper k -colorings of B n under this condition, denoted N diff ( k ) , using the inclusion-exclusion principle applied to its eight edge constraints. Let S be the set of all colorings of the four new vertices without constraints, so | S | = k 4 . For an edge e i , let M i be the set of colorings where its endpoints share the same color. Then: N diff ( k ) = | S | − ∑ i = 1 8 | M i | + ∑ 1 ≤ i < j ≤ 8 | M i ∩ M j | − ∑ 1 ≤ i < j < t ≤ 8 | M i ∩ M j ∩ M t | + … + ( − 1 ) 8 | M 1 ∩ M 2 ∩ … ∩ M 8 | Coefficient Analysis: − 8 k 3 : Each of the 8 edges defines a single constraint | M i | = k 3 , because fixing the color of one endpoint (or satisfying the equality) leaves 3 vertices free. + 26 k 2 : There are 26 compatible edge pairs (out of 28) that can be satisfied simultaneously without color conflicts under the distinct‑central‑colors condition, each giving | M i ∩ M j | = k 2 . − 41 k : Analysis of compatible edge triples yields 41 configurations with | M i ∩ M j ∩ M t | = k . + 26 : The full intersection of all eight constraints corresponds to 26 distinct colorings consistent with the distinct central colors. This combinatorial enumeration yields the chromatic transition polynomial: N diff ( k ) = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 = ψ ( k ) This result is algebraically verified by exact polynomial division: ψ ( k ) = P 3 ( k ) P 2 ( k ) for all k ≥ 3 . Remark 3.2.1 (Methodological Soundness) The polynomial ψ ( k ) is validated through dual independent approaches: The combinatorial inclusion–exclusion derivation provides structural insight into the constraint system, while the exact polynomial division ( ψ ( k ) = P 3 ( k ) P 2 ( k ) ) offers algebraic confirmation, ensuring mathematical rigor. 3.3 Derivation of the recurrence and closed-form expression The structural isolation of B n implies that any proper coloring of G n can be obtained by independently choosing: (i) a proper coloring of G n − 1 and (ii) a proper coloring of B n consistent with the colors of the central vertices in G n − 1 . Consequently, the chromatic polynomials satisfy the fundamental recurrence relation for n ≥ 3 : P n ( k ) = N diff ( k ) P n − 1 ( k ) = ψ ( k ) P n − 1 ( k ) Applying mathematical induction to this recurrence, with P 2 ( k ) as the verified base case, provides the closed-form expression for all n ≥ 2 : P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) . 3.4 Additional analytical and numerical validation • Chromatic Number: Combinatorial reasoning (the presence of disjoint triangles and an explicit constructive 3-coloring) establishes χ = 3 . • Root Analysis: Using calculus (evaluation of ψ ( k ) and its derivative, the Intermediate Value Theorem), we prove the real roots of ψ ( k ) lie within the interval [ 2 , 3 ] . • Asymptotic Growth Rate: The closed-form expression directly implies the exponential growth rate: lim n → ∞ [ P n ( k ) ] 1 n = | ψ ( k ) | . • Numerical Validation: All derived formulas are validated for integer values k ≥ 3 using Wolfram Mathematica confirming the consistency of the recurrence and closed-form expression with directly computed values of P n ( k ) . 4. Results 4.1 Structural analysis of F n × P 2 Theorem 4.1.1: (Structural Properties and Chromatic Implications) For n ≥ 2 , the graph F n × P 2 possesses the following structural properties, which directly affect its chromatic behavior: 1. | V | = 4 n + 2 . 2. | E | = 8 n + 1 . 3. Degree sequence { ( 2 n + 1 ) ( 2 ) , 3 ( 4 n ) } . Where the notation d ( η ) denotes ( η ) vertices of degree d . Proof: 1. Vertex count: Every F n has ( 2 n + 1 ) vertices. The product with P 2 resulting in 2 × ( 2 n + 1 ) = 4 n + 2 vertices. This layering allows a recursive coloring process. 2. Edge count consists of: • Internal edges: 2 × 3 n = 6 n , • Vertical edges: 2 n (connecting peripherals) + 1 (connecting centers) = 2 n + 1 , We get: 6 n + ( 2 n + 1 ) = 8 n + 1 . 3. Degree analysis: • Central Vertices ( 2 vertices): Every center is connected to: 2 n peripheral vertices in its layer. 1 center vertex in the opposite layer. deg = 2 n + 1 . • Peripheral Vertices ( 4 n vertices): Every peripheral vertex is connected to: 1 center vertex in its layer. 1 partner vertex in the same triangle. 1 opposite vertex in the opposite layer. deg = 3 . Thus, the degree sequence is { ( 2 n + 1 ) ( 2 ) , 3 ( 4 n ) } . ∎ Chromatic Significance: This structure includes a hierarchical constraint system: • Central vertices act as chromatic regulators, helping with color separation in both layers. • Peripheral vertices form recursive units, which have local coloring constraints. • Horizontal edges uphold proper coloring across time periods. • Vertical edges prevent color reuse across sequential periods. Theorem 4.1.2: (Edge classification and Distribution) The edge classification derives directly from the vertex degree analysis in Theorem 4.1.1 ( Table 1 ). Proof: The three edge types and their counts are determined as follows: 1. Central Edge: Exactly one edge connects the two central vertices, each of degree ( 2 n + 1 ) . 2. Center-Peripheral Edges: Each central vertex is adjacent to 2 n peripheral vertices in its own layer, yielding 2 × 2 n = 4 n edges of this type. 3. Uniform Peripheral Edges: This set comprises: • The base edges of the n triangles in each layer: 2 × n = 2 n edges. • The vertical edges connecting corresponding peripheral vertices across layers: 2 n edges. Their total is 2 n + 2 n = 4 n edges. This completes the classification. ∎ Proposition 4.1.3: (Graph Properties) The graph F n × P 2 is: 1. Connected, for n ≥ 2 . 2. Non-planar for n ≥ 3 . Proof: 1. Since F n is connected, the Cartesian product with P 2 adds a second layer that is linked to the first through vertical edges between corresponding vertices. These vertical connections ensure that the two layers are joined, so the resulting graph F n × P 2 remains connected. 2. For n ≥ 3 , it contains Κ 3 , 3 minor; therefore, by Kuratowski’s theorem, it is non-planar. ∎ Lemma 4.1.4: (Isolation Lemma for the Block B n ) In the recursive construction of G n = F n × P 2 ( Section 3.1 ), the coloring of the newly attached block B n is conditionally independent of the coloring of the subgraph G n − 1 . Formally, given any fixed pair of distinct colors assigned to the central vertices v 0 A and v 0 B , the number of valid extensions to color the four vertices of B n is a well-defined function N diff ( k ) that depends only on the number of colors k . Proof: The block B n is adjacent to G n − 1 only at the vertices v 0 A and v 0 B . No edge connects B n to any other vertex of G n − 1 . Therefore, once colors for v 0 A and v 0 B are fixed, the coloring constraints are entirely contained within B n , making the extension count independent of the rest of G n − 1 . The symmetry of the coloring problem under permutations of the color set ensures that this count depends only on k . ∎ Table 1. Edge classification in F n × P 2 . Edge type Description Degree of Endpoints Count Central Edge Connects the two central vertices ( 2 n + 1 , 2 n + 1 ) 1 Center-Peripheral Edges Connects central to peripheral vertices ( 2 n + 1 , 3 ) 4 n Uniform Peripheral Edges Connects degree- 3 vertices ( 3 , 3 ) 4 n 4.2 Chromatic polynomial analysis Theorem 4.2.1: (Recurrence Relation) For all n ≥ 3 , the chromatic polynomial of F n × P 2 satisfies a first-order linear recurrence governed by the chromatic transition polynomial ψ ( k ) : P n ( k ) = ψ ( k ) P n − 1 ( k ) , where ψ ( k ) = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 . Proof: The factorization P n ( k ) = N diff ( k ) P n − 1 ( k ) follows from the conditional independence in the recursive construction ( Lemma 4.1.4 ). The equality N diff ( k ) = ψ ( k ) is the result of the combinatorial enumeration detailed in Section 3.2 . ∎ Theorem 4.2.2: (Closed-Form Expression) For n ≥ 2 , the chromatic polynomial of F n × P 2 is given by the closed-form expression: P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) . Proof: By using mathematical induction on n : Base case ( n = 2 ) : Trivially, P 2 ( k ) = [ ψ ( k ) ] 0 P 2 ( k ) . Suppose the formula holds for n − 1 , i.e., P n − 1 ( k ) = [ ψ ( k ) ] n − 3 P 2 ( k ) using the recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) , we substitute the inductive hypothesis: P n ( k ) = ψ ( k ) ( [ ψ ( k ) ] n − 3 P 2 ( k ) ) = [ ψ ( k ) ] n − 2 P 2 ( k ) . ∎ Corollary 4.2.3 (Computational Efficiency) The closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) . reduces the time complexity of computing P n ( k ) from exponential (via the deletion–contraction algorithm) to O ( log n ) using exponentiation by squaring, providing a significant computational advantage for large n . Proposition 4.2.4 (Chromatic Number) For all n ≥ 2 , χ ( F n × P 2 ) = 3 Proof: Since F n × P 2 contains triangles (copies of C 3 ), at least 3 colors are required, establishing the lower bound χ ≥ 3 . To show that 3 colors suffice, we construct an explicit proper 3-coloring c : V → { 1 , 2 , 3 } . Color the two center vertices as c ( v 0 A ) = 1 and c ( v 0 B ) = 2 . For each triangle i ( i = 1 , … , n ) , assign colors to the peripheral vertices as follows: c ( u i A ) = 2 , c ( w i A ) = 3 , c ( u i B ) = 3 , c ( w i B ) = 1 . One may verify that all edges within triangles, between centers, and vertical edges between layers receive distinct colors at their endpoints. Thus, c is a proper 3-coloring, proving the upper bound χ ≤ 3 . Therefore, χ = 3 .∎ 4.3 Algebraic and asymptotic analysis Theorem 4.3.1 (Real Roots of ψ ( k ) ) The chromatic transition polynomial ψ ( k ) = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 has exactly two real roots, both in the interval [ 2 , 3 ] . Proof: Direct evaluation gives ψ ( 2 ) = 0 , ψ ( 2.5 ) = 0.0625 > 0 , ψ ( 3 ) = 2 > 0 . The derivative ψ ′ ( k ) = 4 k 3 − 24 k 2 + 52 k − 41 satisfies ψ ′ ( 2 ) = − 1 0 . Existence: Since ψ ′ ( 2 ) < 0 , ψ is decreasing at k = 2 , so ψ ( 2 + ε ) 0 . With ψ ( 2.5 ) > 0 and ψ continuous, the Intermediate Value Theorem gives a root in ( 2,2.5 ) . Uniqueness: The second derivative ψ ″ ( k ) = 12 k 2 − 48 k + 52 has discriminant − 192 0 everywhere. Thus ψ ′ is strictly increasing and changes sign exactly once in ( 2,2.5 ) , giving at most one root. Combined with existence, the root is unique. Hence ψ has roots at k = 2 and in ( 2,2.5 ) . By the Fundamental Theorem of Algebra, the remaining two roots are complex conjugates. ∎ Theorem 4.3.2 (Exponential Growth Rate) For all k such that ψ ( k ) ≠ 0 and P 2 ( k ) ≠ 0 , we have lim n → ∞ [ P n ( k ) ] 1 n = | ψ ( k ) | Proof: From the closed-form expression in Theorem 4.2.2 , P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) ( n ≥ 2 ) . Write ψ ( k ) in polar form: ψ ( k ) = | ψ ( k ) | e iθ , θ = arg ( ψ ( k ) ) . Then: [ P n ( k ) ] 1 n = | [ ψ ( k ) ] n − 2 P 2 ( k ) | 1 n = | ψ ( k ) | 1 − 2 n . | P 2 ( k ) | 1 n ⋅ e iθ ( 1 − 2 n ) Taking limits: • lim n → ∞ | ψ ( k ) | 1 − 2 n = | ψ ( k ) | , because | ψ ( k ) | is constant and 1 − 2 n → 1 . • lim n → ∞ [ P 2 ( k ) ] 1 n = 1 , since P 2 ( k ) is a non‑zero constant polynomial, and for any constant c > 0 , c 1 n → 1 . • | e iθ ( 1 − 2 n ) | = 1 for all n , since | e iϕ | = 1 for every real ϕ (here ϕ = θ ( 1 − 2 n ) ). Therefore: lim n → ∞ [ P n ( k ) ] 1 n = | ψ ( k ) | . ∎ Note: For integer k ≥ 3 , Table 2 shows ψ ( k ) > 0 , hence in that case | ψ ( k ) | = ψ ( k ) . Corollary 4.3.3 (Ratio Convergence of Chromatic Polynomials) For all k such that ψ ( k ) ≠ 0 , lim n → ∞ P n ( k ) P n − 1 ( k ) = ψ ( k ) . Proof: This follows immediately from the recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) in Theorem 4.2.1 . For n ≥ 3 , we have P n ( k ) P n − 1 ( k ) = ψ ( k ) , so the limit as n → ∞ is trivially ψ ( k ) . ∎ Table 2. Numerical values of P n ( k ) for = 2 , 3 , 4 , and 5 , along with ψ ( k ) at integer values k ≥ 3 . k ψ ( k ) P 2 ( k ) P 3 ( k ) P 4 ( k ) P 5 ( k ) 3 2 24 48 96 192 4 22 5,808 127,776 2,811,072 61,843,584 5 96 184,320 17,694,720 1,698,693,120 163,074,539,520 6 284 2,419,680 687,189,120 195,161,710,080 55,425,925,662,720 Interpretation. The value | ψ ( k ) | serves as the exponential growth constant for the sequence { P n ( k ) } . This establishes ψ ( k ) as the fundamental scaling factor governing the asymptotic expansion of chromatic polynomials. For large n , P n ( k ) scales approximately as | ψ ( k ) | n , indicating that each increment in n multiplies the number of proper colorings by approximately | ψ ( k ) | . Remark 4.3.4 (Asymptotic Behavior and Root Distribution) 1. Theorem 4.3.2 establishes | ψ ( k ) | as the exponential growth constant for the sequence P n ( k ) . For k ≥ 3 , ψ ( k ) itself serves this role. 2. The roots of P n ( k ) comprise: • The fixed roots of P 2 ( k ) , and • The roots of ψ ( k ) , where each root of ψ ( k ) has an algebraic multiplicity of n − 2 . As n → ∞ , the roots of ψ ( k ) dominate the overall distribution, acting as accumulation points in the complex plane. 4.4 Numerical validation To verify the recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) ( Theorem 4.2.1 ) and its closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) ( Theorem 4.2.2 ), we computed the chromatic polynomials P n ( k ) for n = 2 , 3 , 4 , 5 using Wolfram Mathematica. Extensive verification for integer values k ≥ 3 showed perfect agreement among three independent approaches: 1. Direct computation of P n ( k ) , 2. Evaluation using the recurrence relation, 3. Evaluation using the closed-form expression. This numerical validation confirms the consistency of our theoretical results, as summarized in Table 2 . Specific calculations that demonstrate the application of the derived formulas are as follows: • Theorem 4.2.1 : P 3 ( 3 ) = ψ ( 3 ) . P 2 ( 3 ) = 2 . 24 = 48 . • Theorem 4.2.2 : P 5 ( 6 ) = [ ψ ( 6 ) ] 3 P 2 ( 6 ) = 284 3 . 2419680 = 55425925662720 . • Exponential growth: [ P 5 ( 4 ) ] 1 5 = ( 61843584 ) 1 5 ≈ 22.000 ≈ ψ ( 4 ) . The explicit polynomial expressions used as the basis for these computations are: P 2 ( k ) = k 10 − 17 k 9 + 132 k 8 − 614 k 7 + 1882 k 6 − 3932 k 5 + 5581 k 4 − 5165 k 3 + 2808 k 2 − 676 k . P 3 ( k ) = k 14 − 25 k 13 + 294 k 12 − 2153 k 11 + 10949 k 10 − 40806 k 9 + 114575 k 8 − 245171 k 7 + 399378 k 6 − 488483 k 5 + 435287 k 4 − 266994 k 3 + 100724 k 2 − 17576 k . These computations offer conclusive verification of Theorem 4.2.1 and Theorem 4.2.2 for the checked values. Furthermore, the convergence of [ P n ( k ) ] 1 n to ψ ( k ) , numerically validates the exponential growth behavior established in Theorem 4.3.2 . 4.5 Application: A chromatic model for hierarchical conference scheduling The chromatic polynomial P n ( k ) of the graph G = F n × P 2 is used to model a constrained two-period conference scheduling system. 4.5.1 Model Specification: A Two-Period Conference The conference structure is modeled by the friendship graph F n , where: • Central vertex: Refers to the conference coordinator. • Triangles: Refers to the research teams and their relationship to the coordinator. Each team must complete two different tasks: a. Project presentation. b. Brainstorming and discussion. These tasks are scheduled across two consecutive periods (e.g., morning and afternoon sessions). The system specifications include: • Participants: One coordinator and n independent teams. • Sessions: Two time periods with two task types per team. • Resources: k identical meeting rooms. • Objective: Assign rooms to all sessions while satisfying scheduling constraints. 4.5.2 Graph-Theoretic Representation The graph G = F n × P 2 yield all scheduling constraints by its vertex and edge structure: • Vertices: Refer to all sessions (coordinator and teams across both periods) • Edges: Represent conflicts and constraints: - Horizontal edges: Prevent simultaneous room usage for related sessions. - Vertical edges: Prevent room reuse by the same team across consecutive periods. 4.5.3 Chromatic Polynomial as Scheduling Tool The Chromatic polynomial P n ( k ) computes all valid room allocation schedules that satisfy the following critical conditions: 1. Conflict avoidance: No two conflicting sessions share the same room. 2. Temporal separation: No room reuse for the same team across consecutive periods. 3. Constraint compliance: All session-specific scheduling constraints are observed. 4.5.4 Analytical Planning Insights The closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) offers important insights for conference planning: • Feasibility Threshold: The real root of ψ ( k ) at k min ≈ 2.5 refers to the theoretical minimum rooms required, but the chromatic number χ ( F n × P 2 ) = 3 shows the practical minimum, meaning that 3 rooms are enough for any conference size. • Scalability Analysis: The growth rate determined by ψ ( k ) predicts how room demand scales with the increase in teams, establishing the fundamental mathematical relationship between conference size and resource requirements. • Flexibility Quantification: The chromatic polynomial value P n ( k ) directly measures the theoretical flexibility space accessible to planners, with higher values indicating greater resilience against scheduling constraints. These theoretical insights define the basic boundaries with possibilities of the scheduling system, which we will quantitatively check in the following section. 4.5.5 Quantitative Performance Analysis Based on the theoretical framework, we conduct a performance analysis of the conference scheduling model using the calculated values of P n ( k ) . This translation turns abstract graph-theoretic concepts into concrete planning metrics. Our analysis focuses on three key performance measures derived from the chromatic model: (1) the practical feasibility threshold, validated by the chromatic number χ = 3 ; (2) the measured scheduling flexibility, quantified directly by the chromatic polynomial P n ( k ) ; and (3) the observed scalability indicator, defined by the growth rate of P n ( k ) with respect to n . Scheduling with the Minimum Required Rooms ( k = 3 ) The operational feasibility of the theoretical chromatic number is demonstrated numerically. For a growing number of teams n , the number of valid conflict-free schedules P n ( 3 ) exhibits exact exponential growth, doubling with each added team: P n ( 3 ) = 2 . P n − 1 ( 3 ) . The specific values for conferences of different scales are compiled in Table 3 , confirming that any conference with n ≥ 2 teams can be scheduled with only three rooms. Table 3. Conference scheduling with minimum rooms. Conference scale Teams ( n ) Valid schedules ( P n ( 3 ) ) Growth factor Small Conference 3 48 --- Medium Conference 4 96 × 2 Medium Conference 5 192 × 2 Large Conference 6 384 × 2 Quantifying the Impact of Additional Resources To evaluate the gains from increased resources, we compare the scheduling flexibility P n ( k ) for k = 3 , 4 , 5 . The results, detailed in Table 4 , reveal the principle of exponential resource leverage. A single additional room (moving from k = 3 to k = 4 ) increases the number of valid schedules for 5 teams from 192 to over 61.8 million. This represents a gain factor of approximately 22 , which equals ψ ( 4 ) . Similarly, providing five rooms yields a gain factor of approximately 96, equaling ψ ( 5 ) . These values were computed using the closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) , where ψ ( 4 ) = 22 and ψ ( 5 ) = 96 . Table 4. Impact of room availability on scheduling flexibility. Scenario k P 4 ( k ) P 5 ( k ) Gain ( P 5 ( k ) vs P 4 ( k ) ) Minimal Rooms 3 96 192 × 2 Added Flexibility 4 2,811,072 61,843,584 ≈ × 22 High Flexibility 5 1,698,693,120 163,074,539,520 ≈ × 96 Key Findings 1. Operational Feasibility: Empirical data confirm that the theoretical chromatic minimum of three rooms ( χ = 3 ) is both necessary and sufficient for practical scheduling, regardless of conference size ( n ≥ 2 ) . 2. Exponential Flexibility Growth: Using only the minimum rooms, scheduling flexibility grows exponentially. Each additional team doubles the number of valid schedules, as dictated by the exact recurrence P n ( 3 ) = 2 . P n − 1 ( 3 ) , which is demonstrated by the data in Table 3 . 3. Exponential Resource Leverage: Marginal increases in resources yield disproportionately large gains in flexibility. Crucially, the gain factor achieved by adding one room is exactly the value of the chromatic transition polynomial ψ ( k ) , directly translating a graph-theoretic invariant into a concrete measure of operational efficiency, as quantified in Table 4 . 4.5.6 Model Interpretation for Decision Support This framework translates the mathematical constructs of F n × P 2 and its chromatic polynomial into actionable insights for conference planners. Table 5 provides the complete, systematic mapping that underpins this translation, linking each graph-theoretic element to its concrete scheduling counterpart and its direct practical significance for decision-makers. Table 5. From graph elements to scheduling decisions. Mathematical element Scheduling representation Practical significance for planners Graph F n × P 2 Two-period conference model Foundational structural framework Central vertices Coordinator sessions Main scheduling constraint Peripheral vertices Team sessions Team-specific resource requirement and task allocations Horizontal edges Concurrent session conflicts Prevent concurrent room use for related sessions Vertical edges Cross-period session constraints Assure no room is reused by the same team for sequential time slots P n ( k ) Number of conflict-free schedules Primary Flexibility Metric: Higher values indicate greater resilience to changes χ = 3 Absolute minimum room requirement Feasibility Guarantee: Establishes a strict lower bound for resource allocation ψ ( k ) Flexibility multiplier per team Scalability Predictor: Enables forecasting of resource needs as the conference grows Real root of ψ ( k ) in [ 2 , 3 ] Theoretical k threshold Planning Threshold: Highlights the critical transition from infeasible ( k = 2 ) to feasible ( k = 3 ) scheduling The mapping elucidates the following core principles: • The graph F n × P 2 serves as the foundational structural model for the entire two-period conference. • Its vertices directly represent physical scheduling entities: central vertices correspond to coordinator sessions, while peripheral vertices represent team-specific sessions, thereby defining the core resource allocation requirements. • The edges explicitly model the two critical types of scheduling conflicts: horizontal edges prevent concurrent room usage for related sessions, and vertical edges enforce the constraint that a team cannot reuse the same room across consecutive time periods. • Most importantly, the key algebraic results—the chromatic polynomial P n ( k ) , the chromatic number χ = 3 , the transition polynomial ψ ( k ) , and its real root in [ 2 , 3 ] —are transformed into practical planning tools. These tools quantitatively measure flexibility, guarantee minimum resource feasibility, predict scalability, and identify critical resource thresholds. This structured translation equips planners with a clear, actionable methodology. It enables them to leverage the rigorous guarantees and predictive power of graph theory to make informed, concrete scheduling decisions and formulate robust, mathematically-grounded resource allocation strategies. 4.5.7 Model Limitations and Assumptions 1. All teams have identical scheduling constraints. 2. Meeting rooms are homogeneous and interchangeable. 3. No additional temporal constraints beyond the two-period framework. 4. The model assumes complete conflict graphs without probabilistic elements. 5. Discussion 5.1 Theoretical contribution This work provides a complete algebraic characterization of the chromatic polynomial for F n × P 2 . The recurrence relation P n ( k ) = ψ ( k ) P n − 1 ( k ) establishes ψ ( k ) as a new graph invariant that encodes the recursive constraint structure of this graph family. Crucially, the existence and constancy of this invariant stem from the structural symmetry and conditional independence of the recursively attached blocks B n —a property formalized in Lemma 4.1.4 . Unlike well-documented results for standard Cartesian products, 9 , 12 this addresses a previously unexplored structure. Furthermore, the stability of the chromatic number at χ = 3 despite linear growth in order ( | V | = 4 n + 2 ), highlights how restrictive local features determine global properties—a fundamental decoupling of structural scale from chromatic complexity. 6 , 7 5.2 Practical utility The chromatic polynomial serves as a direct quantitative tool in our two-period conference scheduling model, building upon established graph-coloring paradigms. 1 , 13 The closed-form expression P n ( k ) = [ ψ ( k ) ] n − 2 P 2 ( k ) reveals ψ ( k ) as a flexibility multiplier: each additional room increases feasible schedules by a factor of ψ ( k ) per team. For instance, moving from k = 3 to k = 4 rooms yields a ψ ( 4 ) = 22 -fold increase in valid allocations, as quantified in Table 4 , transforming an abstract invariant into a practical decision-support metric. From a computational perspective, the recurrence enables substantial efficiency gains. Computing P n ( k ) via exponentiation by squaring reduces the time complexity from exponential (under deletion–contraction) to O ( log n ) . This demonstrates how structural insights into graph families can yield algorithmic improvements, rendering an otherwise intractable problem practical for large n . In scheduling terms, evaluating P 100 ( k ) requires only about seven multiplications—feasible for real-time planning—whereas generic methods would be prohibitive. Thus, the work bridges pure graph theory with applied computation: the same algebraic invariant that elucidates the chromatic structure also enables efficient enumeration, directly informing both algorithmic design and resource-allocation decisions in constrained environments. 5.3 Limitations and future directions The model assumes identical resources and a two-period framework, suggesting natural extensions: 1. Generalization to F n × P m for m > 2 for multi-period scheduling. 2. Enhanced models incorporating heterogeneous resources via list-chromatic polynomials or weighted coloring models. 3. Theoretical connections between the asymptotic distribution of chromatic roots and phase transitions in the Potts model. 16 Ethical considerations This study does not involve human participants, animal subjects, or sensitive data. Therefore, no ethical approval was required. Use of AI-assisted technology During manuscript revision, DeepSeek (deepseek.com) was used as a supplementary tool for language editing and algebraic verification. The authors critically reviewed all output and take full responsibility for the final work. Data availability This is a theoretical study in algebraic graph theory. All results, including the recurrence relation, the closed-form expression for the chromatic polynomial, and all numerical values, are derived analytically and presented within the article. No external datasets were generated or analyzed. All findings are fully reproducible using the formulas and methods provided in Sections 3 and 4 . Reporting guidelines This is a theoretical mathematical study and does not involve clinical trials, animal experiments, observational studies, or qualitative research. Therefore, no specific reporting guidelines (e.g., CONSORT, ARRIVE, STROBE, COREQ) are applicable. Acknowledgements The authors thank Tikrit University for providing academic support and resources. References 1. Kannan M, Sathiragavan M, Nivetha P, et al. : Graph coloring techniques in scheduling and resource allocation. Journal of Nonlinear Analysis and Optimization. 2024; 15 (2-3). 2. Sazdanovic R, Scofield D: Structure of the chromatic polynomial. arXiv preprint arXiv:2411.15088. 2024. 3. Abbas Q, Mustafa G: Chromatic polynomial of a picture fuzzy graph with application in traffic light control. J. Appl. Math. Comput. 2024; 70 (2): 1395–1418. 4. Arif NE, Hasni R, Alikhani S: Chromatic polynomials of certain polyphenylene dendrimers. J. Comput. Theor. Nanosci. 2012; 9 (4): 560–563. 5. Dong F, Koh KM: Foundations of the chromatic polynomial. Handbook of the Tutte Polynomial and Related Topics. Chapman and Hall/CRC; 2022; 213–251. 6. Imrich W, Klavžar S, Rall DF: Topics in graph theory: Graphs and their Cartesian product. CRC Press; 2008. 7. Rall DF: Graph products and coloring.Nadjafi-Arani MJ, Khodkar A, editors. Topics in graph theory. Nova Science Publishers; 2012; 45–62. 8. Ismael WS, Copel HB, Kamdon SU: Chromatic polynomials of n-centipede and triangular snake TS n graphs. Advances and Applications in Discrete Mathematics. 2023; 36 : 1–9. 9. Christina M, Nigro M, Sasaki D: The chromatic polynomial of layered graphs. Mat. Contemp. 2025; 1 : 1–8. 10. Yadav R, Sehgal A, Sehgal S, et al. : The chromatic polynomial of grid graph P 3 □ P n . J. Appl. Math. Comput. 2024; 70 (1): 619–637. 11. Nizami AR, Munir M, Khan AS, et al. : On chromaticity of ladder-type graphs. Science International (Lahore). 2016; 28 (2): 829–836. 12. Pfaff TJ, Walker J: The chromatic polynomial of P 2 × P n and C 3 × P n . Missouri Journal of Mathematical Sciences. 2008; 20 (3): 169–177. 13. Vyas MN, Hemalatha GB: Exam scheduling using graph coloring. Journal of Information Systems Engineering and Management. 2025; 10 (24s). 14. Ali A, Chartrand G, Zhang P: Irregularity in graphs. Springer International Publishing; 2021. 15. Shi Y, Dehmer M, Li X, et al. : Graph polynomials. CRC Press; 2017. 16. Takahashi R: Expansions of the Potts model partition function along deletions and contractions. arXiv preprint arXiv:2405.07612. 2024. Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 04 Mar 2026 ADD YOUR COMMENT Comment Author details Author details 1 Mathematics, Tikrit University, Tikrit, Saladin Governorate, 34001, Iraq Sarah M. Talab Roles: Conceptualization, Formal Analysis, Investigation, Methodology, Resources, Validation, Visualization, Writing – Original Draft Preparation, Writing – Review & Editing Nabeel E. Arif Roles: Supervision Competing interests No competing interests were disclosed. Grant information The author(s) declared that no grants were involved in supporting this work. Article Versions (1) version 1 Published: 04 Mar 2026, 15:351 https://doi.org/10.12688/f1000research.176896.1 Copyright © 2026 M. Talab S and E. Arif N. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article M. Talab S and E. Arif N. Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.12688/f1000research.176896.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 1 VERSION 1 PUBLISHED 04 Mar 2026 Views 0 Cite How to cite this report: Amiroch S. Reviewer Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r474977 ) The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-474977 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 11 May 2026 Siti Amiroch , Universitas Islam Darul ‘ulum, Lamongan, Indonesia Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.195018.r474977 Reviewer Report The manuscript studies the chromatic polynomial of the graph family F n x P 2 , where F n denotes the friendship graph and P 2 is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, and the ... Continue reading READ ALL Reviewer Report The manuscript studies the chromatic polynomial of the graph family F n x P 2 , where F n denotes the friendship graph and P 2 is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, and the recursive structure considered in the paper is potentially useful. The manuscript is generally organised in a logical sequence and the numerical examples help illustrate the proposed recurrence relation. General Evaluation The main contribution of the paper is the derivation of a recurrence relation and a closed-form expression for the chromatic polynomial of F n x P 2 , together with structural observations, chromatic number analysis, asymptotic interpretation, and a scheduling application. The recursive approach is promising. However, several substantive issues require correction before the manuscript can be considered suitable for publication in a high-quality Scopus-indexed journal. Strengths 1. The paper addresses a specialised and relevant family of Cartesian product graphs. 2. The recursive decomposition is a promising approach for obtaining a compact chromatic polynomial formula. 3. The chromatic number result is useful and consistent with the triangular structure of the graph. 4. The numerical examples support the recurrence formula for the tested cases. 5. The attempt to connect the algebraic results with scheduling applications gives the paper potential applied relevance. Main Comments and Recommendations 1. Section 3.2 — Derivation of the transition polynomial The derivation of the transition polynomial ψ(k) requires substantial clarification. The coefficients in ψ k = k 4 -8 k 3 +26 k 2 -41k+26 are stated without a complete enumeration of the corresponding inclusion–exclusion terms. Since this polynomial is the central component of the recurrence and closed-form formula, the manuscript should provide either a full counting table, a structured case analysis, or an appendix containing the complete derivation. 2. Section 4.1 — Claim on non-planarity The assertion that F n x P 2 is non-planar for n ≥ 3 is not sufficiently justified. The manuscript states that the graph contains a K 3,3 minor, but no explicit construction of such a minor is provided. This is a substantial mathematical claim and should either be proved rigorously by specifying the required branch sets or revised if the claim does not hold. 3. Section 4.2 — Computational complexity The statement that the closed-form expression reduces the computation of P n (k) to O(log n) is too broad. This claim is valid only for numerical evaluation at a fixed value of k using exponentiation by squaring. It does not apply to symbolic expansion of the polynomial, since the degree and output size increase with n. The statement should be qualified accordingly. 4. Section 4.3 — Asymptotic growth The asymptotic statement involving P n (k) 1 n should be formulated more carefully. For general real or complex values of k, the mathematically safer formulation should involve P n (k) 1 n . The current expression is valid only under additional restrictions, for example for integer k ≥ 3. These restrictions should be made explicit. 5. Section 4.5 — Scheduling interpretation The scheduling interpretation contains two important issues. First, the non-integer real root of ψ(k) should not be interpreted as a theoretical minimum number of rooms. In a scheduling problem, the number of rooms is discrete, and feasibility is determined by the chromatic number χ = 3. Secondly, ψ(4) = 22 is interpreted as the gain obtained by increasing the number of rooms from 3 to 4, whereas ψ(k) represents the growth factor when the number of teams increases while k is fixed. These interpretations should be corrected to avoid overstating the practical implications of the model. 6. Section 4.5 — Mapping between the graph and the scheduling model The correspondence between F n x P 2 and the proposed conference scheduling model is not yet sufficiently precise. The graph has 4n + 2 vertices, but the description involving one coordinator, n teams, two periods, and two tasks per team does not clearly explain how these scheduling entities produce exactly 4n + 2 vertices. A clearer vertex-to-session and edge-to-conflict mapping is required for the application to be convincing. Final Recommendation The manuscript has a promising mathematical core, particularly in its recursive treatment of F n x P 2 . However, the derivation of the transition polynomial, the structural claim on non-planarity, the asymptotic formulation, and the scheduling interpretation require substantial revision. In its present form, the manuscript is not yet suitable for publication in the journal. A major revision is recommended. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Partly Competing Interests: No competing interests were disclosed. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Amiroch S. Reviewer Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r474977 ) The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-474977 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Hibi W. Reviewer Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r476650 ) The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-476650 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 28 Apr 2026 Wafiq Hibi , Academic College of Sakhni, Sakhnin, Israel Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.195018.r476650 The manuscript studies the chromatic polynomial of the graph family F n × P 2 ​, where Fn denotes the friendship graph and P2​ is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, ... Continue reading READ ALL The manuscript studies the chromatic polynomial of the graph family F n × P 2 ​, where Fn denotes the friendship graph and P2​ is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, and the paper addresses a graph family that has received limited direct attention in the literature. The manuscript is generally well organized and the results are presented in a logical sequence. General Evaluation: The main contribution of the paper is the derivation of a recurrence relation and a closed-form expression for the chromatic polynomial of F n × P 2​, together with structural properties, chromatic number analysis, asymptotic interpretation, and an illustrative scheduling application. The central formula appears mathematically consistent, and the numerical examples support the stated recurrence. The overall direction of the work is sound and potentially useful for researchers interested in graph products and chromatic invariants. Strengths The paper studies a nontrivial and specialized family of Cartesian product graphs. The recurrence framework is elegant and gives a compact closed-form representation. The structural results (order, size, chromatic number) are useful and coherent. Numerical verification is included and supports the theoretical formulas. The scheduling section provides a practical interpretation of the graph-coloring model. Main Comments and Recommendations 1. Proof of the Transition Polynomial The most important result is the derivation of the transition polynomial ψ(k)= = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 Although the result appears correct, the derivation is presented too briefly. The manuscript states that Inclusion–Exclusion is applied to eight constraints, but the key coefficients (26, 41, 26) are not derived transparently. For mathematical clarity and reproducibility, the authors should expand this section substantially. Recommendation: Include either: a complete combinatorial derivation, or a structured case analysis, or a supplementary appendix containing the full counting argument. 2. Recursive Independence Argument The argument that the newly attached block contributes independently once the colors of the two central vertices are fixed is reasonable, but it would benefit from a more formal proof and clearer notation. Recommendation: State the independence lemma more explicitly and clarify why no additional constraints arise from previous blocks. 3. Notation and Typography Several expressions suffer from formatting inconsistencies (subscripts, spacing, symbols, repeated notation, typographical artifacts). This occasionally affects readability. Recommendation: Carefully revise notation throughout the manuscript and ensure all formulas are typeset consistently. 4. Scheduling Application The application is interesting as a motivating example, but it should be presented clearly as an illustrative use-case rather than a major applied breakthrough. Recommendation: Shorten slightly or explicitly frame it as a demonstration of potential applicability. Final Recommendation This is a worthwhile mathematical contribution with a correct and interesting central result. However, the exposition of the main proof should be strengthened before final acceptance. After moderate revision focused on rigor, clarity, and presentation, the paper would be suitable for indexing. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Yes References 1. Hibi, W. (2022). Assembling Planer Graphs to Service the Coloring Number. Review of International Geographical Education Online, 12(1), 28-31. Competing Interests: No competing interests were disclosed. Reviewer Expertise: Mathematics Education and Applied Graph Theory in Teaching and Learning Contexts I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Hibi W. Reviewer Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r476650 ) The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-476650 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 04 Mar 2026 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 2 Version 1 04 Mar 26 read read Wafiq Hibi , Academic College of Sakhni, Sakhnin, Israel Siti Amiroch , Universitas Islam Darul ‘ulum, Lamongan, Indonesia Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2026 Amiroch S. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 11 May 2026 | for Version 1 Siti Amiroch , Universitas Islam Darul ‘ulum, Lamongan, Indonesia 0 Views copyright © 2026 Amiroch S. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Report The manuscript studies the chromatic polynomial of the graph family F n x P 2 , where F n denotes the friendship graph and P 2 is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, and the recursive structure considered in the paper is potentially useful. The manuscript is generally organised in a logical sequence and the numerical examples help illustrate the proposed recurrence relation. General Evaluation The main contribution of the paper is the derivation of a recurrence relation and a closed-form expression for the chromatic polynomial of F n x P 2 , together with structural observations, chromatic number analysis, asymptotic interpretation, and a scheduling application. The recursive approach is promising. However, several substantive issues require correction before the manuscript can be considered suitable for publication in a high-quality Scopus-indexed journal. Strengths 1. The paper addresses a specialised and relevant family of Cartesian product graphs. 2. The recursive decomposition is a promising approach for obtaining a compact chromatic polynomial formula. 3. The chromatic number result is useful and consistent with the triangular structure of the graph. 4. The numerical examples support the recurrence formula for the tested cases. 5. The attempt to connect the algebraic results with scheduling applications gives the paper potential applied relevance. Main Comments and Recommendations 1. Section 3.2 — Derivation of the transition polynomial The derivation of the transition polynomial ψ(k) requires substantial clarification. The coefficients in ψ k = k 4 -8 k 3 +26 k 2 -41k+26 are stated without a complete enumeration of the corresponding inclusion–exclusion terms. Since this polynomial is the central component of the recurrence and closed-form formula, the manuscript should provide either a full counting table, a structured case analysis, or an appendix containing the complete derivation. 2. Section 4.1 — Claim on non-planarity The assertion that F n x P 2 is non-planar for n ≥ 3 is not sufficiently justified. The manuscript states that the graph contains a K 3,3 minor, but no explicit construction of such a minor is provided. This is a substantial mathematical claim and should either be proved rigorously by specifying the required branch sets or revised if the claim does not hold. 3. Section 4.2 — Computational complexity The statement that the closed-form expression reduces the computation of P n (k) to O(log n) is too broad. This claim is valid only for numerical evaluation at a fixed value of k using exponentiation by squaring. It does not apply to symbolic expansion of the polynomial, since the degree and output size increase with n. The statement should be qualified accordingly. 4. Section 4.3 — Asymptotic growth The asymptotic statement involving P n (k) 1 n should be formulated more carefully. For general real or complex values of k, the mathematically safer formulation should involve P n (k) 1 n . The current expression is valid only under additional restrictions, for example for integer k ≥ 3. These restrictions should be made explicit. 5. Section 4.5 — Scheduling interpretation The scheduling interpretation contains two important issues. First, the non-integer real root of ψ(k) should not be interpreted as a theoretical minimum number of rooms. In a scheduling problem, the number of rooms is discrete, and feasibility is determined by the chromatic number χ = 3. Secondly, ψ(4) = 22 is interpreted as the gain obtained by increasing the number of rooms from 3 to 4, whereas ψ(k) represents the growth factor when the number of teams increases while k is fixed. These interpretations should be corrected to avoid overstating the practical implications of the model. 6. Section 4.5 — Mapping between the graph and the scheduling model The correspondence between F n x P 2 and the proposed conference scheduling model is not yet sufficiently precise. The graph has 4n + 2 vertices, but the description involving one coordinator, n teams, two periods, and two tasks per team does not clearly explain how these scheduling entities produce exactly 4n + 2 vertices. A clearer vertex-to-session and edge-to-conflict mapping is required for the application to be convincing. Final Recommendation The manuscript has a promising mathematical core, particularly in its recursive treatment of F n x P 2 . However, the derivation of the transition polynomial, the structural claim on non-planarity, the asymptotic formulation, and the scheduling interpretation require substantial revision. In its present form, the manuscript is not yet suitable for publication in the journal. A major revision is recommended. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Partly Competing Interests No competing interests were disclosed. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (0) Amiroch S. Peer Review Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r474977) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-474977 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2026 Hibi W. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 28 Apr 2026 | for Version 1 Wafiq Hibi , Academic College of Sakhni, Sakhnin, Israel 0 Views copyright © 2026 Hibi W. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The manuscript studies the chromatic polynomial of the graph family F n × P 2 ​, where Fn denotes the friendship graph and P2​ is the path on two vertices. The topic is relevant to algebraic and combinatorial graph theory, and the paper addresses a graph family that has received limited direct attention in the literature. The manuscript is generally well organized and the results are presented in a logical sequence. General Evaluation: The main contribution of the paper is the derivation of a recurrence relation and a closed-form expression for the chromatic polynomial of F n × P 2​, together with structural properties, chromatic number analysis, asymptotic interpretation, and an illustrative scheduling application. The central formula appears mathematically consistent, and the numerical examples support the stated recurrence. The overall direction of the work is sound and potentially useful for researchers interested in graph products and chromatic invariants. Strengths The paper studies a nontrivial and specialized family of Cartesian product graphs. The recurrence framework is elegant and gives a compact closed-form representation. The structural results (order, size, chromatic number) are useful and coherent. Numerical verification is included and supports the theoretical formulas. The scheduling section provides a practical interpretation of the graph-coloring model. Main Comments and Recommendations 1. Proof of the Transition Polynomial The most important result is the derivation of the transition polynomial ψ(k)= = k 4 − 8 k 3 + 26 k 2 − 41 k + 26 Although the result appears correct, the derivation is presented too briefly. The manuscript states that Inclusion–Exclusion is applied to eight constraints, but the key coefficients (26, 41, 26) are not derived transparently. For mathematical clarity and reproducibility, the authors should expand this section substantially. Recommendation: Include either: a complete combinatorial derivation, or a structured case analysis, or a supplementary appendix containing the full counting argument. 2. Recursive Independence Argument The argument that the newly attached block contributes independently once the colors of the two central vertices are fixed is reasonable, but it would benefit from a more formal proof and clearer notation. Recommendation: State the independence lemma more explicitly and clarify why no additional constraints arise from previous blocks. 3. Notation and Typography Several expressions suffer from formatting inconsistencies (subscripts, spacing, symbols, repeated notation, typographical artifacts). This occasionally affects readability. Recommendation: Carefully revise notation throughout the manuscript and ensure all formulas are typeset consistently. 4. Scheduling Application The application is interesting as a motivating example, but it should be presented clearly as an illustrative use-case rather than a major applied breakthrough. Recommendation: Shorten slightly or explicitly frame it as a demonstration of potential applicability. Final Recommendation This is a worthwhile mathematical contribution with a correct and interesting central result. However, the exposition of the main proof should be strengthened before final acceptance. After moderate revision focused on rigor, clarity, and presentation, the paper would be suitable for indexing. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Yes References 1. Hibi, W. (2022). Assembling Planer Graphs to Service the Coloring Number. Review of International Geographical Education Online, 12(1), 28-31. Competing Interests No competing interests were disclosed. Reviewer Expertise Mathematics Education and Applied Graph Theory in Teaching and Learning Contexts I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (0) Hibi W. Peer Review Report For: Chromatic Polynomials of F n × P 2 Graphs: Algebraic Analysis and Scheduling Applications [version 1; peer review: 2 approved with reservations] . F1000Research 2026, 15 :351 ( https://doi.org/10.5256/f1000research.195018.r476650) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/15-351/v1#referee-response-476650 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "Chromatic Polynomials of Fn\u00D7P2 \u00A0Graphs:...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/15-351/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/15-351/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/15-351/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('M. Talab S and E. Arif N'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/15-351/v1/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/15-351", templates : { twitter : "Chromatic Polynomials of Fn\u00D7P2 \u00A0Graphs: Algebraic Analysis.... M. Talab S and E. Arif N, published by " + "@F1000Research" + ", https://f1000research.com/articles/15-351/v1" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/176896/195018") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "195018"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "471967": 0, "471966": 0, "471965": 0, "471964": 0, "471973": 0, "471972": 0, "471971": 0, "471970": 0, "471969": 0, "471968": 0, "480303": 0, "480302": 0, "480301": 0, "480300": 0, "480299": 0, "480298": 0, "480307": 0, "480306": 0, "480305": 0, "480304": 0, "467007": 0, "467006": 0, "467005": 0, "467004": 0, "467003": 0, "468679": 0, "468678": 0, "467012": 0, "467011": 0, "467010": 0, "467009": 0, "467008": 0, "468687": 0, "468686": 0, "468685": 0, "468684": 0, "468683": 0, "468682": 0, "468681": 0, "468680": 0, "474975": 0, "474974": 0, "474973": 0, "474972": 0, "474971": 0, "474970": 0, "474969": 0, "476647": 0, "476646": 0, "474978": 0, "474977": 5, "474976": 0, "476655": 0, "476654": 0, "476653": 0, "476652": 0, "476651": 0, "476650": 7, "476649": 0, "476648": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "f3f5c5be-e0e3-4329-88f9-45a505bde2c4"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });